#include <cstdint>
#include <iostream>
#include <istream>
#include <queue>
#include <vector>
using ll = int;
#define printf
#define pv(v)do{printf("[DEBUG] %s= %lld\n",#v,(v));}while(0)

ll n,m,q,u,v,t;
double p;
std::vector<ll> a;
std::priority_queue<ll> pq;

int main(){
    std::iostream::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::cin>>n>>m>>q>>u>>v>>t;
    p=double(u)/double(v);
    a.resize(n+1);
    for(ll i=1;i<=n;i++){
        std::cin>>a[i];
        pq.emplace(a[i]);
    }

    for(ll i=0;i<m;i++){ // 7e6*log(m)
        pv(i);
        ll qi=q*i,top=pq.top()+qi;
        pv(pq.top());
        pq.pop();
        pv(top);
        pv(qi);
        ll a=p*top,b=top-a;
        pq.emplace(a-qi-q);
        pq.emplace(b-qi-q);
        if((i+1)%t==0){
            std::cout<<top<<" ";
        }
    }
    std::cout<<"\n";
    ll idx=1;
    const ll qm=q*m;
    while(pq.size()){
        if(idx%t==0){
            std::cout<<pq.top()+qm<<" ";
        }
        pq.pop();
        idx++;
    }
    std::cout<<"\n";
}